Virtualized Wireless Networks by Tho Le-Ngoc Rajesh Dawadi Saeedeh Parsaeefard & Mahsa Derakhshani

Author:Tho Le-Ngoc, Rajesh Dawadi, Saeedeh Parsaeefard & Mahsa Derakhshani
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

3.3 Proposed Algorithm

To solve (3.2), we propose the iterative Algorithm 3.1, where first, we calculate  based on a given P, and then, use the derived  to calculate P as follows:

(3.3)

where t > 0 is the iteration number, , P(t)∗ are the optimal values at iteration t. The iterative procedure is stopped when

where 0 < ɛ 1 ≪ 1 and 0 < ɛ 2 ≪ 1. Note that the user association and power allocation problems are still non-convex and suffer from high computational complexity. In developing an efficient algorithm, we apply CGP via different transformations and convexification approaches to solve the sequence of lower-bound GP-based approximations as discussed in the following sub-sections.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.